ADDITIVE STRUCTURE OF THE GROUP OF UNITS MOD p, WITH CORE AND CARRY CONCEPTS FOR EXTENSION TO INTEGERS

نویسنده

  • N. F. BENSCHOP
چکیده

The additive structure of multiplicative semigroup Zpk = Z(·) mod pk is analysed for prime p > 2. Order (p − 1)pk−1 of cyclic group Gk of units mod pk implies product Gk ≡ AkBk , with cyclic ’core’ Ak of order p−1 so np ≡ n for core elements, and ’extension subgroup’ Bk of order p k−1 consisting of all units n ≡ 1 mod p, generated by p+1. The p-th power residues np mod pk in Gk form an order |Gk|/p subgroup Fk, with |Fk|/|Ak| = pk−2, so Fk properly contains core Ak for k ≥ 3. The additive structure of subgroups Ak, Fk and Gk is derived by successor function S(n) = n+1, and by considering the two arithmetic symmetries C(n) = −n and I(n) = n−1 as functions, with commuting IC = CI, where S does not commute with I nor C. The four distinct compositions SCI, CIS, CSI, ISC all have period 3 upon iteration. This yields a triplet structure in Gk of three inverse pairs (ni, n −1 i ) with ni + 1 ≡ −(ni+1)−1 for i = 0, 1, 2 where n0 · n1 · n2 ≡ 1 mod pk, generalizing the cubic root solution n + 1 ≡ −n−1 ≡ −n2 mod pk (p ≡ 1 mod 6). Any solution in core: (x + y)p ≡ x + y ≡ xp + yp mod pk>1 has exponent p distributing over a sum, shown to imply the known FLT inequality for integers. In such equivalence mod pk (FLT case1) the three terms can be interpreted as naturals n < pk, so np < pkp, and the (p − 1)k produced carries cause FLT inequality. In fact, inequivalence mod p3k+1 is derived for the cubic roots of 1 mod pk(p≡ 1 mod 6).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Fermat to Waring

The ring Zk(+, .) mod p k with prime power modulus (prime p > 2) is analysed. Its cyclic group Gk of units has order (p − 1)p, and all p-th power n residues form a subgroup Fk with |Fk| = |Gk|/p. The subgroup of order p − 1, the core Ak of Gk, extends Fermat’s Small Theorem (FST ) to mod p, consisting of p − 1 residues with n ≡ n mod p. The concept of carry, e.g. n in FST extension n ≡ np + 1 m...

متن کامل

Evaluating the Application of Reinforcement Correction Factor for Concrete Core Testing

This study investigates the reinforcement correction factor of concrete core in more detail to prepare appropriate outlines for interpretation of results. This investigation aims to minimize uncertainties involved to carry out the more realistic condition assessment of suspect buildings before taking up retrofitting/strengthening measures. For this purpose, an extensive experimental program inc...

متن کامل

Prevalence of Serologic Markers of Hepatitis B and C and Risk Factors among Dentists and Physicians in Kerman, Iran

In this cross sectional anonymous study, blood samples of 285 dentists and Physicians were tested for hepatitis B surface antigen (HBs Ag), hepatitis B envelope Ag (HBe Ag), antibodies to: hepatitis B suface (anti-HBs), hepatitis B core Ag (anti-HBc) and hepatitis B envelope Ag (anti-HBe) by ELISA-3 and antibody to hepatitis C virus (anti-HCV) by ELISA-3 and immunoblotting tests. The results su...

متن کامل

Efficient long division via Montgomery multiply

We present a novel right-to-left long division algorithm based on the Montgomery modular multiply, consisting of separate highly efficient loops with simple carry structure for computing first the remainder (x mod q) and then the quotient ⌊x/q⌋. These loops are ideally suited for the case where x occupies many more machine words than the divide modulus q, and are strictly linear time in the “bi...

متن کامل

Instruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2m)

The performance of elliptic curve (EC) cryptosystems depends essentially on efficient arithmetic in the underlying finite field. Binary finite fields GF(2m) have the advantage of “carry-free” addition. Multiplication, on the other hand, is rather costly since polynomial arithmetic is not supported by general-purpose processors. In this paper we propose a combined hardware/software approach to o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005